Skip to main content
Log in

Truss decomposition using triangle graphs

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Recent studies have shown that social networks exhibit interesting characteristics such as community structures, i.e., vertexes can be clustered into communities that are densely connected together and loosely connected to other vertices. In order to identify communities, several definitions were proposed that can characterize the density of connections among vertices in the networks. Dense triangle cores, also known as k-trusses, are subgraphs in which every edge participates at least \(k-2\) triangles (a clique of size 3), exhibiting a high degree of cohesiveness among vertices. There are a number of research works that propose k-truss decomposition algorithms. However, existing in-memory algorithms for computing k-truss are inefficient for handling today’s massive networks. In this paper, we propose an efficient, yet scalable algorithm for finding k-trusses in a large-scale network. To this end, we propose a new structure, called triangle graph to speed up the process of finding the k-trusses and prove the correctness and efficiency of our method. We also evaluate the performance of the proposed algorithms through extensive experiments using real-world networks. The results of comprehensive experiments show that the proposed algorithms outperform the state-of-the-art methods by several orders of magnitudes in running time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. The proof can be found in Wang and Cheng (2012).

  2. The proof follows immediately from the properties of k-truss presented in Wang and Cheng (2012), Cohen (2008), Malliaros et al. (2020).

  3. We made all the source codes publicly available on GitHub under link: https://github.com/mrezvani110/ktruss.

References

  • Almasri M, Anjum O, Pearson C, Qureshi Z, Mailthody VS, Nagi R, Xiong J, Hwu W-m (2019) Update on k-truss decomposition on gpu. In: 2019 IEEE high performance extreme computing conference (HPEC), pp 1–7

  • Arifuzzaman S, Khan M, Marathe M (2013) PATRIC: a parallel algorithm for counting triangles in massive networks. In: Proceedings of CIKM, pp 529–538. ACM

  • Cheng J, Ke Y, Chu S, Ozsu MT (2011) Efficient core decomposition in massive networks. In: Proceedings of ICDE, pp 51–62. IEEE

  • Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’11). Association for Computing Machinery, New York, NY, USA, pp 1082–1090. https://doi.org/10.1145/2020408.2020579

  • Chu S, Cheng J (2011) Triangle listing in massive networks and its applications. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 672–680

  • Cohen J (2008) Trusses: cohesive subgraphs for social network analysis. National Security Agency Technical Report

  • Cohen J (2009) Graph twiddling in a mapreduce world. Comput Sci Eng 11(4):29–41

    Article  Google Scholar 

  • Conte A, De Sensi D, Grossi R, Marino A, Versari L (2020) Truly scalable k-truss and max-truss algorithms for community detection in graphs. IEEE Access 8:139096–139109

    Article  Google Scholar 

  • Conte A, De Sensi D, Grossi R, Marino A, Versari L (2018) Discovering k-trusses in large-scale networks. In: 2018 IEEE high performance extreme computing conference (HPEC), pp 1–6

  • Fang Y, Xin Huang L, Qin YZ, Zhang W, Cheng R, Lin X (2020) A survey of community search over big graphs. VLDB J 29(1):353–392

    Article  Google Scholar 

  • Ghosh S, Halappanavar M (2020) TriC: distributed-memory triangle counting by exploiting the graph structure. In: 2020 IEEE high performance extreme computing conference (HPEC), pp 1–6

  • Habib Wafaa MA, Mokhtar Hoda MO, El-Sharkawi ME (2020) Weight-based k-truss community search via edge attachment. IEEE Access 8:148841–148852

    Article  Google Scholar 

  • Hanneman RA, Riddle M (2005) Introduction to social network methods. University of California

  • Huang S, El-Hadedy M, Hao C, Li Q, Mailthody VS, Date K, Xiong J, Deming C, Rakesh N, Wen-mei H (2018) Triangle counting and truss decomposition using FPGA. In: 2018 IEEE high performance extreme computing conference (HPEC), pp 1–7. IEEE

  • Hu X, Tao Y, Chung C-W (2013) Massive graph triangulation. In: Proceedings of SIGMOD, pp 325–336. ACM

  • Jiang Y, Huang X, Cheng H (2021) I/O efficient \(k\)-truss community search in massive graphs. VLDB J 30:713–738. https://doi.org/10.1007/s00778-020-00649-y

  • Kong Y-X, Shi G-Y, Rui-Jie W, Zhang Y-C (2019) k-core: theories and applications. Physics reports

  • Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http://snap.stanford.edu/data, June

  • Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539–547

  • Malliaros FD, Giatsidis C, Papadopoulos AN, Vazirgiannis M (2020) The core decomposition of networks: theory, algorithms and applications. VLDB J 29(1):61–92

    Article  Google Scholar 

  • MIT/Amazon/IEEE. GraphChallenge. https://graphchallenge.mit.edu/. [Online; accessed 11-August-2020]

  • Pandey S, Li XS, Buluc A, Xu J, Liu H (2019) H-INDEX: hash-indexing for parallel triangle counting on GPUs. In: 2019 IEEE high performance extreme computing conference (HPEC), pp 1–7

  • Park H-M, Chung C-W (2013) An efficient mapreduce algorithm for counting triangles in a very large graph. In: Proceedings of CIKM, pp 539–548. ACM

  • Pearce R, Sanders G (2018) K-truss decomposition for scale-free graphs at scale in distributed memory. In: 2018 IEEE high performance extreme computing conference (HPEC), pp 1–6. IEEE

  • Quick L, Wilkinson P, Hardcastle D (2012) Using pregel-like large scale graph processing frameworks for social network analysis. In: Proceedings of ASONAM, pp 457–463

  • Rong-Hua L, Qin L, Yu Jeffrey X, Rui M (2015) Influential community search in large networks. Proc VLDB Endowment 8(5):509–520

    Article  Google Scholar 

  • Schank T, Wagner D (2005) Finding, counting and listing all triangles in large graphs, an experimental study. In: Proceedings of WEA, pp 606–609

  • Shao Y, Chen L, Cui B (2014) Efficient cohesive subgraphs detection in parallel network analysis. In: Proceedings of SIGMOD

  • Smith S, Liu X, Ahmed NK, Tom AS, Petrini F, Karypis G (2017) Truss decomposition on shared-memory parallel systems. In: 2017 IEEE high performance extreme computing conference (HPEC), pp 1–6. IEEE

  • Tangwongsan K, Pavan A, Tirthapura S (2013) Parallel triangle counting in massive streaming graphs. In: Proceedings of CIKM, pp 781–786. ACM

  • Wang J, Cheng J (2012) Truss decomposition in massive networks. In: Proceedings of VLDB, pp 812–823

  • Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181–213

    Article  Google Scholar 

  • Yin H, Benson AR, Leskovec J, Gleich DF (2017) Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 555–564

  • Zhao F, Tung Anthony KH (2012) Large scale cohesive subgraphs discovery for social network visual analysis. In: Proceedings of VLDB, pp 85–96

Download references

Acknowledgements

The authors would like to acknowledge the financial support of the Shahrood University of Technology for this research under project No: 14016.

Funding

This research has not been funded by any academic or industrial grant.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohsen Rezvani.

Ethics declarations

Conflict of Interest

Author A, Mohsen Rezvani, declares that he has no conflict of interest. Author B, Mojtaba Rezvani, declares that he has no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rezvani, M., Rezvani, M. Truss decomposition using triangle graphs. Soft Comput 26, 55–68 (2022). https://doi.org/10.1007/s00500-021-06468-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-06468-9

Keywords

Navigation